Trees with an On-Line Degree Ramsey Number of Four
نویسندگان
چکیده
منابع مشابه
Trees with an On-Line Degree Ramsey Number of Four
On-line Ramsey theory studies a graph-building game between two players. The player called Builder builds edges one at a time, and the player called Painter paints each new edge red or blue after it is built. The graph constructed is called the background graph. Builder’s goal is to cause the background graph to contain a monochromatic copy of a given goal graph, and Painter’s goal is to preven...
متن کاملDirected Ramsey number for trees
In this paper, we study Ramsey-type problems for directed graphs. We first consider the k-colour oriented Ramsey number of H, denoted by − →r (H, k), which is the least n for which every k-edgecoloured tournament on n vertices contains a monochromatic copy of H. We prove that − →r (T, k) ≤ ck|T |k for any oriented tree T . This is a generalisation of a similar result for directed paths by Chvát...
متن کاملRamsey goodness of bounded degree trees
Given a pair of graphs G and H, the Ramsey number R(G,H) is the smallest N such that every red-blue coloring of the edges of the complete graph KN contains a red copy of G or a blue copy of H. If a graph G is connected, it is well known and easy to show that R(G,H) ≥ (|G| − 1)(χ(H) − 1) + σ(H), where χ(H) is the chromatic number of H and σ(H) is the size of the smallest color class in a χ(H)-co...
متن کاملThe size-Ramsey number of trees
Given a graph G, the size-Ramsey number r̂(G) is the minimum number m for which there exists a graph F on m edges such that any two-coloring of the edges of F admits a monochromatic copy of G. In 1983, J. Beck introduced an invariant β(·) for trees and showed that r̂(T ) = Ω(β(T )). Moreover he conjectured that r̂(T ) = Θ(β(T )). We settle this conjecture by providing a family of graphs and an emb...
متن کاملThe Size-Ramsey Number of Trees
If G and H are graphs, let us write G → (H)2 if G contains a monochromatic copy ofH in any 2-colouring of the edges of G. The size-Ramsey number re(H) of a graph H is the smallest possible number of edges a graph G may have if G→ (H)2. Suppose T is a tree of order |T | ≥ 2, and let t0, t1 be the cardinalities of the vertex classes of T as a bipartite graph, and let ∆(T ) be the maximal degree o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2011
ISSN: 1077-8926
DOI: 10.37236/660